Optimal differential approximation
نویسندگان
چکیده
منابع مشابه
Optimal order finite element approximation for a hyperbolic integro-differential equation
Semidiscrete finite element approximation of a hyperbolic type integro-differential equation is studied. The model problem is treated as the wave equation which is perturbed with a memory term. Stability estimates are obtained for a slightly more general problem. These, based on energy method, are used to prove optimal order a priori error estimates.
متن کاملAsymptotically Optimal Approximation and Numerical Solutions of Differential Equations
Given finite subset J ⊂ IR, and a point λ ∈ IR, we study in this paper the possible convergence, as h→ 0, of the coefficients in least-squares approximation to f(·+hλ) from the space spanned by (f(·+ hj)j∈J . We invoke the ‘least solution of the polynomial interpolation problem’ to show that the coefficient do converge for a generic J and λ, provided that the underlying function f is sufficient...
متن کاملoptimal order finite element approximation for a hyperbolic integro-differential equation
semidiscrete finite element approximation of a hyperbolic type integro-differential equation is studied. the model problem is treated as the wave equation which is perturbed with a memory term. stability estimates are obtained for a slightly more general problem. these, based on energy method, are used to prove optimal order a priori error estimates.
متن کاملstrong approximation for itô stochastic differential equations
in this paper, a class of semi-implicit two-stage stochastic runge-kutta methods (srks) of strong global order one, with minimum principal error constants are given. these methods are applied to solve itô stochastic differential equations (sdes) with a wiener process. the efficiency of this method with respect to explicit two-stage itô runge-kutta methods (irks), it method, milstien method, sem...
متن کاملOptimal Belief Approximation
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how “embarrassing” it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1972
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90036-4